On the Occurrences of Fibonacci Sequences in the Counting of Hatchings in Linear Polygonal Chains
نویسنده
چکیده
The graphs considered here will be finite and will have no multiple edges. Let G be such a graph. A matching in G is a spanning subgraph whose components are nodes and edges only. We define a k-matching in G to be a matching with k edges. When the matching consists of edges only, it will be called a perfect matching. The number of perfect matchings in G will be denoted by y(G). The total number of matchings in G will be denoted by T(£). The following example illustrates the above definitions.
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملخواص الکترونی یک زنجیر فیبوناچی
Using a tight-binding model and transfer-matrix technique, as well as Lanczos algorithm, we numerically investigate the nature of the electronic states and electron transmission in site, bond and mixing Fibonacci model chains. We rely on the Landauer formalism as the basis for studying the conduction properties of these systems. Calculating the Lyapunov exponent, we also study the localization...
متن کاملA Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence
In this article, a class of convergent series based on Fibonacci sequence is introduced for which there is a golden ratio (i.e. $frac{1+sqrt 5}{2}),$ with respect to convergence analysis. A class of sequences are at first built using two consecutive numbers of Fibonacci sequence and, therefore, new sequences have been used in order to introduce a new class of series. All properties of the se...
متن کاملToeplitz transforms of Fibonacci sequences
We introduce a matricial Toeplitz transform and prove that the Toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. We investigate the injectivity of this transform and show how this distinguishes the Fibonacci sequence among other recurrence sequences. We then obtain new Fibonacci identities as an application of our transform.
متن کاملAbsorption Spectra of a Graphene Embedded One Dimensional Fibonacci Aperiodic Structure
In this paper, we explore the linear response of one dimensionalquasiperiodic structure based on Fibonacci sequence composed of silicon dioxide,polystyrene and graphene materials. Here, a graphene monolayer is sandwichedbetween two adjacent layers. The numerical results are obtained by using the standardtransfer matrix method. Due to the presence of graphene sheet in eac...
متن کامل